In mathematics, logic and computer science, a formal language is called recursively enumerable (also recognizable, partially decidable or Turing-acceptable) if it is a recursively enumerable subset in the set of all possible words over the alphabet of the language, i.e.